Optimal bounds for the change-making problem
نویسندگان
چکیده
منابع مشابه
Optimal Bounds for the Change-Making Problem
The change making problem is the problem of representing a given value with the fewest coins possible We investigate the prob lem of determining whether the greedy algorithm produces an opti mal representation of all amounts for a given set of coin denominations c c cm Chang and Gill show that if the greedy algorithm is not always optimal then there exists a counterexample x in the range c x cm...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولOptimal bounds for the colored Tverberg problem
We prove a “Tverberg type” multiple intersection theorem. It strengthens the prime case of the original Tverberg theorem from 1966, as well as the topological Tverberg theorem of Bárány et al. (1980), by adding color constraints. It also provides an improved bound for the (topological) colored Tverberg problem of Bárány & Larman (1992) that is tight in the prime case and asymptotically optimal ...
متن کاملTowards Optimal Bounds for Implicit Factorization Problem
We propose a new algorithm to solve the Implicit Factorization Problem, which was introduced by May and Ritzenhofen at PKC’09. In 2011, Sarkar and Maitra (IEEE TIT 57(6): 4002-4013, 2011) improved May and Ritzenhofen’s results by making use of the technique for solving multivariate approximate common divisors problem. In this paper, based on the observation that the desired root of the equation...
متن کاملOptimal backward perturbation bounds for the linear least squares problem
Dedicated to William Kahan and Beresford Parlett on the occasion of their 60th birthdays Let A be an m n matrix, b be an m-vector, and x̃ be a purported solution to the problem of minimizing kb Axk2. We consider the following open problem: find the smallest perturbation E of A such that the vector x̃ exactly minimizes kb (A+E)xk2. This problem is completely solved whenE is measured in the Frobeni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90134-1